The Sylvester Resultant Matrix and Image Deblurring
نویسنده
چکیده
This paper describes the application of the Sylvester resultant matrix to image deblurring. In particular, an image is represented as a bivariate polynomial and it is shown that operations on polynomials, specifically greatest common divisor (GCD) computations and polynomial divisions, enable the point spread function to be calculated and an image to be deblurred. The GCD computations are performed using the Sylvester resultant matrix, which is a structured matrix, and thus a structure-preserving matrix method is used to obtain a deblurred image. Examples of blurred and deblurred images are presented, and the results are compared with the deblurred images obtained from other methods.
منابع مشابه
Blind image deconvolution using the Sylvester matrix
Blind image deconvolution refers to the process of determining both an exact image and the blurring function from its inexact image. This thesis presents a solution of the blind image deconvolution problem using polynomial computations. The proposed solution does not require prior knowledge of the blurring function or noise level. Blind image deconvolution is needed in many applications, such a...
متن کاملOn the Construction of Generic Mixed Cayley-Sylvester Resultant Matrix
For a generic n-degree polynomial system which contains n+1 polynomials in n variables, we give the construction of the generic mixed Cayley-Sylvester resultant matrix. There are n− 1 generic mixed Cayley-Sylvester resultant matrices between the classical Cayley resultant matrix and the classical Sylvester resultant matrix. The entries of these new resultant matrix are of degree m(1 < m < n + 1...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014